Some positive news on the proportionate open shop problem

A tabu search approach for proportionate multiprocessor open shop scheduling

In the multiprocessor open shop scheduling problem, jobs are to be processed on a set of processing centers -each having one or more parallel identical machines, while jobs do not have a pre-specified obligatory route. A special case is the proportionate multiprocessor open shop scheduling problem (PMOSP) in which the processing time on a given center is not job-dependent. Applications of the P...

Cat swarm optimization for solving the open shop scheduling problem

This paper aims to prove the efficiency of an adapted computationally intelligence-based behavior of cats called the cat swarm optimization algorithm, that solves the open shop scheduling problem, classified as NP-hard which its importance appears in several industrial and manufacturing applications. The cat swarm optimization algorithm was applied to solve some benchmark instances from the lit...

Proportionate flow shop games

In a proportionate flow shop problem several jobs have to be processed through a fixed sequence of machines and the processing time of each job is equal on all machines. By identifying jobs with agents whose costs linearly depend on the completion time of their jobs and assuming an initial processing order on the jobs, we face two problems: the first is how to obtain an optimal order that minim...

The cyclic compact open-shop scheduling problem

We consider a variation of the classical nonpreemptive open-shop scheduling problem. For the normal open shop, finding whether a schedule exists in T time units is NP-complete [2]. The main difference with the classical model is that we will consider so-called periodical or cyclic schedules; this means that the schedule obtained is repeated periodically. If the length of a period is k time unit...

A tabu search algorithm for the open shop scheduling problem